Cache-efficient sweeping-based interval joins for extended Allen relation predicates

Abstract We develop a family of efficient plane-sweeping interval join algorithms for evaluating wide range predicates such as Allen’s relationships and parameterized relationships. Our technique is based on framework, components which can be flexibly combined in different manners to support the required relation. In temporal databases, our exploit well-known flexible access method, Timeline Index, thus expanding set operations it supports even further. Additionally, employing compact data structure, gapless hash map, we utilize CPU cache efficiently. an experimental evaluation, show that approach several times faster scales better than state-of-the-art techniques, while being much suited real-time event processing.